منابع مشابه
Finding finite B2-sequences faster
A B2-sequence is a sequence a1 < a2 < · · · < ar of positive integers such that the sums ai + aj , 1 ≤ i ≤ j ≤ r, are different. When q is a power of a prime and θ is a primitive element in GF (q2) then there are B2-sequences A(q, θ) of size q with aq < q2, which were discovered by R. C. Bose and S. Chowla. In Theorem 2.1 I will give a faster alternative to the definition. In Theorem 2.2 I will...
متن کاملFinding Outbreaks Faster
Rapid detection, reporting, and response to an infectious disease outbreak are critical to prevent localized health events from emerging as pandemic threats. Metrics to evaluate the timeliness of these critical activities, however, are lacking. Easily understood and comparable measures for tracking progress and encouraging investment in rapid detection, reporting, and response are sorely needed...
متن کاملFinding Even Subgraphs Even Faster
Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to obtain a connected graph in which all th...
متن کاملFinding Faster Configurations using FLASH
Finding good configurations for a software system is often challenging since the number of configuration options can be large. Software engineers often make poor choices about configuration or, even worse, they usually use a sub-optimal configuration in production, which leads to inadequate performance. To assist engineers in finding the (near) optimal configuration, this paper introduces FLASH...
متن کاملFinding Even Cycles Even Faster
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1998
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-98-00986-7